Stereoselective synthesis of the C-11 to C-19 segment of macrolactin 3 via a center inversion followed by Oxa-Michael addition approach

An efficient and short stereoselective synthesis of C11–C19 fragment of Macrolactin 3 was achieved. The vic-triol moiety (C15–C17) was derived from the C2–C4 chiral centers of D-mannose. The C-1 of D-mannose was utilized for the Wittig-olefination followed by hydroxylation using hydroboration reaction to introduce C11–C13 carbon chain in the C11–C19 fragment, whereas C5–C6 carbon chain of mannose was converted into C18–C19 of the target by dehydration reactions. Thus, the main strategy was (a) two consecutive Wittig-olefination reactions on C1 carbon of mannose, (b) inversion of C4 stereocenter, and (c) dehydration of C5–C6 vic-diol to olefin to result in the C11–C19 fragment.     

轨形Gromov-Witten不变量沿光滑点的加权涨开公式

本文考虑,当一个紧辛轨形群胚(X,ω)沿着光滑点作加权涨开时,它的形如<α_1,…,α_m,[pt]>_(g,A)~X的轨形Gromov-Witten不变量的变化公式,其中[pt]∈H_(dR)~(2n)(X)是生成元,dimX=2n.我们证明了对于非零A∈H_2(|X|,Z),<α_1,…,α_m,[pt]>_(g,A)~X={_(g_1,pl(A)-e’)~xdimX=4,g≥0,∑((-1)g_1·2)/(2g_1+2)!_(g_2,pl(A)-e’)~xdimX=6,g≥0,_(g_1,pl(A)-e’)~xdimX≥8,g=0其中x是X沿一光滑点的权α=(α_1,…,α_n)的加权涨开,且α_1≥α_i,2≤i≤n.     

A second‐order ensemble method based on a blended backward differentiation formula timestepping scheme for time‐dependent Navier–Stokes equations

We present a second‐order ensemble method based on a blended three‐step backward differentiation formula (BDF) timestepping scheme to compute an ensemble of Navier–Stokes equations. Compared with the only existing second‐order ensemble method that combines the two‐step BDF timestepping scheme and a special explicit second‐order Adams–Bashforth treatment of the advection term, this method is more accurate with nominal increase in computational cost. We give comprehensive stability and error analysis for the method. Numerical examples are also provided to verify theoretical results and demonstrate the improved accuracy of the method. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 34–61, 2017     

三项指数和四次均值的精确计算公式(2)

本文进一步深入研究了三项指数和四次均值的计算问题.运用指数和的相关性质并结合求解同余方程组的方法与技巧,利用两种不同的方法获得了两个精确的均值计算公式,揭示了三项指数和的计算与同余方程组解的个数之间的本质联系,推广了已有的结果.     

二项指数和四次混合均值的计算

本文研究了二项指数和四次均值的计算问题.利用初等数论及代数数论的方法获得了一个精确的计算公式以及一个转换公式,推广了已有的结果,揭示了均值计算与同余方程组的本质联系.     

基于三次Bézier基函数插值的GM(1,1)模型背景值优化研究

本文研究了传统灰色GM(1,1)模型存在模型精度不高的问题.利用带形状参数的三次Bézier基函数,给出插值函数的表达式,并结合复化梯形公式,给定误差限的方法,获得了比传统灰色GM(1,1)模型更高精度的结果.推广了传统灰色GM(1,1)预测模型的结果.     

Limit theorems for random walks

We consider a random walk $S_{\tau }$ which is obtained from the simple random walk $S$ by a discrete time version of Bochner’s subordination. We prove that under certain conditions on the subordinator $\tau$ appropriately scaled random walk $S_{\tau }$ converges in the Skorohod space to the symmetric $\alpha$-stable process $B^{\alpha }$. We also prove asymptotic formula for the transition function of $S_{\tau }$ similar to the Pólya’s asymptotic formula for $B^{\alpha }$.     

Rough path properties for local time of symmetric α stable process

In this paper, we first prove that the local time associated with symmetric $\alpha$-stable processes is of bounded $p$-variation for any $p>\frac{2}{\alpha ?1}$ partly based on Barlow’s estimation of the modulus of the local time of such processes.  The fact that the local time is of bounded $p$-variation for any $p>\frac{2}{\alpha ?1}$ enables us to define the integral of the local time ${\int }_{?\infty }^{\infty }{?}_{?}^{\alpha ?1}f\left(x\right)d_x{L}_t^x$ as a Young integral for less smooth functions being of bounded $q$-variation with $1\le q<\frac{2}{3?\alpha }$. When $q\ge \frac{2}{3?\alpha }$, Young’s integration theory is no longer applicable. However, rough path theory is useful in this case. The main purpose of this paper is to establish a rough path theory for the integration with respect to the local times of symmetric $\alpha$-stable processes for $\frac{2}{3?\alpha }\le q<4$.     

关于求解随机用户均衡问题的截断拟牛顿型信赖域法研究

信赖域法是一种保证全局收敛性的优化算法,为避免Hessian矩阵的计算,基于拟牛顿校正公式构造了求解带线性等式约束的非线性规划问题的截断拟牛顿型信赖域法.首先给出了截断拟牛顿型信赖域法的构造过程及具体步骤;然后针对随机用户均衡模型中变量和约束的特点对算法进行了修正,并将多种拟牛顿校正公式下所得结果与牛顿型信赖域法的结果进行了比较,结果发现基于对称秩1校正公式的信赖域法更为合适.最后基于数值算例结果得到了一些在算法编程过程中的重要结论,对其它形式信赖域法的编程实现具有一定的参考意义.